Перевод: со всех языков на английский

с английского на все языки

inequality constraints

См. также в других словарях:

  • Differential variational inequality — In mathematics, a differential variational inequality (DVI) is a dynamical system that incorporates ordinary differential equations and variational inequalities or complementarity problems. DVIs are useful for representing models involving both… …   Wikipedia

  • Wigner-d'Espagnat inequality — The Wigner d Espagnat inequality is a basic result of set theory.It is named for Eugene Wigner and Bernard d Espagnat who (as pointed out by Bell) both employed it in their popularizations of quantum mechanics.Given a set S with three subsets, J …   Wikipedia

  • Linear inequality — In mathematics a linear inequality is an inequality which involves a linear function.Formal definitionsWhen operating in terms of real numbers, linear inequalities are the ones written in the forms: f(x) < b ext{ or }f(x) leq b,where f(x) is a… …   Wikipedia

  • Variational inequality — is a mathematical theory intended for the study of equilibrium problems. Guido Stampacchia put forth the theory in 1964 to study partial differential equations. The applicability of the theory has since been expanded to include problems from… …   Wikipedia

  • Linear matrix inequality — In convex optimization, a linear matrix inequality (LMI) is an expression of the form: LMI(y):=A 0+y 1A 1+y 2A 2+cdots+y m A mgeq0,where * y= [y i,, i!=!1dots m] is a real vector, * A 0,, A 1,, A 2,,dots,A m are symmetric matrices in the subspace …   Wikipedia

  • Karush–Kuhn–Tucker conditions — In mathematics, the Karush–Kuhn–Tucker (KKT) conditions (also known as the Kuhn–Tucker conditions) are necessary for a solution in nonlinear programming to be optimal, provided that some regularity conditions are satisfied. Allowing inequality… …   Wikipedia

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • Mathematical economics — Economics …   Wikipedia

  • optimization — /op teuh meuh zay sheuhn/ 1. the fact of optimizing; making the best of anything. 2. the condition of being optimized. 3. Math. a mathematical technique for finding a maximum or minimum value of a function of several variables subject to a set of …   Universalium

  • Constraint (mathematics) — In mathematics, a constraint is a condition that a solution to an optimization problem must satisfy. There are two types of constraints: equality constraints and inequality constraints. The set of solutions that satisfy all constraints is called… …   Wikipedia

  • Multidisciplinary design optimization — Multi disciplinary design optimization (MDO) is a field of engineering that uses optimization methods to solve design problems incorporating a number of disciplines. As defined by Prof. Carlo Poloni, MDO is the art of finding the best compromise …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»